/**
*      author: Y_Yao
*      created: 2025-02-28 10:43:39
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 5e3 + 7;
int A,B;
int n;
string s;
int ans = LLINF;

void solve()
{
    cin >> n >> A >> B;
    cin >> s;
    for(int k = 0;k < n;k++)
    {
        int cnt = 0;
        for(int i = 0;i < n / 2;i++)
        {
            int pos1 = (i + k) % n;
            int pos2 = (k + n - 1 - i) % n;
            if(s[pos1] != s[pos2])
            {
                cnt++;
            }
        }
        int cost = k * A + cnt * B;
        ans = min(ans,cost);
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}